Diophantine equations involving primes, II

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diophantine Equations Involving Arithmetic Functions of Factorials

DIOPHANTINE EQUATIONS INVOLVING ARITHMETIC FUNCTIONS OF FACTORIALS Daniel M. Baczkowski We examine and classify the solutions to certain Diophantine equations involving factorials and some well known arithmetic functions. F. Luca has showed that there are finitely many solutions to the equation:

متن کامل

On Some Diophantine Equations (ii)

In [7] we have studied the equation m − n = py, where p is a prime natural number p ≥ 3. Using the above result, in this paper, we study the equations ck(x 4 + 6px y +py) + 4pdk(x y + pxy) = 32z with p ∈ {5, 13, 29, 37}, where (ck, dk) is a solution of the Pell equation ∣∣c2 − pd2∣∣ = 1.

متن کامل

Diophantine Approximation by Primes

We show that whenever δ > 0 and constants λi satisfy some necessary conditions, there are infinitely many prime triples p1, p2, p3 satisfying the inequality |λ0 + λ1p1 + λ2p2 + λ3p3| < (max pj)−2/9+δ. The proof uses Davenport–Heilbronn adaption of the circle method together with a vector sieve method. 2000 Mathematics Subject Classification. 11D75, 11N36, 11P32.

متن کامل

Infinitely many insolvable Diophantine equations II

Let f(X1, . . . , Xm) be a quadratic form in m variables X1, . . . , Xm with integer coefficients. Then it is well-known that the Diophantine equation f(X1, . . . , Xm) = 0 has a nontrivial solution in integers if and only if the equation has a nontrivial solution in real numbers and the congruence f(X1, . . . , Xm) ≡ 0 (mod N) has a nontrivial solution for every integer N > 1. Such a principle...

متن کامل

Diophantine m-tuples for primes

In this paper, we show that if p is a prime and ifA = {a1, a2, . . . , am} is a set of positive integers with the property that aiaj +p is a perfect square for all 1 ≤ i < j ≤ m, then m < 3 · 2168. More generally, when p is replaced by a squarefree integer n, the inequality m ≤ f(ω(n)) holds with some function f , where ω(n) is the number of prime divisors of n. We also give upper bounds for m ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Polonici Mathematici

سال: 1968

ISSN: 0066-2216,1730-6272

DOI: 10.4064/ap-20-3-259-266